On sharp bounds of the zero-order Randić index of certain unicyclic graphs
نویسندگان
چکیده
منابع مشابه
On sharp bounds of the zero-order Randic index of certain unicyclic graphs
Let G be a simple connected graph and t be a given real number. The zero-order general Randić index αt(G) of G is defined as ∑ v∈V (G) d(v) t , where d(v) denotes the degree of v. In this paper, for any t , we characterize the graphs with the greatest and the smallest αt within two subclasses of connected unicyclic graphs on n vertices, namely, unicyclic graphs with k pendant vertices and unicy...
متن کاملSharp lower bounds for the Zagreb indices of unicyclic graphs
The first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices of the respective graph. In this paper we present the lower bound on M1 and M2 among all unicyclic graphs of given order, maximum degree, and cycle length, and characterize graphs for which th...
متن کاملOn the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملOn Harmonic Index and Diameter of Unicyclic Graphs
The Harmonic index $ H(G) $ of a graph $ G $ is defined as the sum of the weights $ dfrac{2}{d(u)+d(v)} $ of all edges $ uv $ of $G$, where $d(u)$ denotes the degree of the vertex $u$ in $G$. In this work, we prove the conjecture $dfrac{H(G)}{D(G)} geq dfrac{1}{2}+dfrac{1}{3(n-1)} $ given by Jianxi Liu in 2013 when G is a unicyclic graph and give a better bound $ dfrac{H(G)}{D(G)}geq dfra...
متن کاملOn the Wiener Index of Unicyclic Graphs
The Wiener index of a graph G is defined as W (G) = ∑ u,v dG(u, v), where dG(u, v) is the distance between u and v in G, and the sum goes over all pairs of vertices. In this paper, we characterize the connected unicyclic graph with minimum Wiener indices among all connected unicyclic graphs of order n and girth g with k pendent vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2009
ISSN: 0893-9659
DOI: 10.1016/j.aml.2008.06.035